#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
ll a[500010];
int main()
{
    IOS;
    ll n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    ll index=0;
    for(int i=1;i<=n;i++){
        if(a[i]>=2*a[1]){
            index=i;break;
        }
    }
    if(index==0){
        cout<<n<<endl;return 0;
    }
    ll ans=n;
    for(int pre=1;index<=n;index++){
        while(index<=n&&a[index]<a[pre]*2)index++;
        if(index>n)break;
        ans--;
        pre++;
    }    
    cout<<ans<<endl;
    getchar();
    getchar();
    return 0;
}
